Computing masses from effective transfer matrices.
نویسندگان
چکیده
We study the use of effective transfer matrices for the numerical computation of masses (or correlation lengths) in lattice spin models. The effective transfer matrix has a strongly reduced number of components. Its definition is motivated by a renormalization group transformation of the full model onto a 1-dimensional spin model. The matrix elements of the effective transfer matrix can be determined by Monte Carlo simulation. We show that the mass gap can be recovered exactly from the spectrum of the effective transfer matrix. As a first step towards application we performed a Monte Carlo study for the 2-dimensional Ising model. For the simulations in the broken phase we employed a multimagnetical demon algorithm. The results for the tunnelling correlation length are particularly encouraging. CERN-TH.6844/93 March 1993
منابع مشابه
Computing the Matrix Geometric Mean of Two HPD Matrices: A Stable Iterative Method
A new iteration scheme for computing the sign of a matrix which has no pure imaginary eigenvalues is presented. Then, by applying a well-known identity in matrix functions theory, an algorithm for computing the geometric mean of two Hermitian positive definite matrices is constructed. Moreover, another efficient algorithm for this purpose is derived free from the computation of principal matrix...
متن کاملVibration Analysis of Multi-Step Bernoulli-Euler and Timoshenko Beams Carrying Concentrated Masses
In this paper, vibration analysis of multiple-stepped Bernoulli-Euler and Timoshenko beams carrying point masses is presented analytically for various boundary conditions. Each attached element is considered to have both translational and rotational inertias. The method of solution is “transfer matrix method” which is based on the changes in the vibration modes at the vicinity of any discontinu...
متن کاملA mathematically simple method based on denition for computing eigenvalues, generalized eigenvalues and quadratic eigenvalues of matrices
In this paper, a fundamentally new method, based on the denition, is introduced for numerical computation of eigenvalues, generalized eigenvalues and quadratic eigenvalues of matrices. Some examples are provided to show the accuracy and reliability of the proposed method. It is shown that the proposed method gives other sequences than that of existing methods but they still are convergent to th...
متن کاملAn Effective Task Scheduling Framework for Cloud Computing using NSGA-II
Cloud computing is a model for convenient on-demand user’s access to changeable and configurable computing resources such as networks, servers, storage, applications, and services with minimal management of resources and service provider interaction. Task scheduling is regarded as a fundamental issue in cloud computing which aims at distributing the load on the different resources of a distribu...
متن کاملComputation of the q-th roots of circulant matrices
In this paper, we investigate the reduced form of circulant matrices and we show that the problem of computing the q-th roots of a nonsingular circulant matrix A can be reduced to that of computing the q-th roots of two half size matrices B - C and B + C.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Physical review. D, Particles and fields
دوره 49 1 شماره
صفحات -
تاریخ انتشار 1994